A simple spectral algorithm for recovering planted partitions
نویسندگان
چکیده
منابع مشابه
A Simple Spectral Algorithm for Recovering Planted Partitions
In this paper, we consider the planted partition model, in which n = ks vertices of a random graph are partitioned into k “clusters,” each of size s. Edges between vertices in the same cluster and different clusters are included with constant probability p and q, respectively (where 0 ≤ q < p ≤ 1). We give an efficient algorithm that, with high probability, recovers the clustering as long as th...
متن کاملRecovering Nonuniform Planted Partitions via Iterated Projection
In the planted partition problem, the n vertices of a random graph are partitioned into k “clusters,” and edges between vertices in the same cluster and different clusters are included with constant probability p and q, respectively (where 0 ≤ q < p ≤ 1). We give an efficient spectral algorithm that recovers the clusters with high probability, provided that the sizes of any two clusters are eit...
متن کاملA Spectral Algorithm for Improving Graph Partitions
In the cut-improvement problem, we are asked, given a starting cut (T, T̄ ) in a graphG, to find a cut with low conductance around (T, T̄ ) or produce a certificate that there is none. More precisely, for a notion of correlation between cuts, cut-improvement algorithms seek to produce approximation guarantees of the following form: for any cut (C, C̄) that is ε-correlated with the input cut, the c...
متن کاملA simple algorithm for spectral line deconvolution
The objective of this work is to develop a numerical procedure to subtract the instrumental function from a measured spectral line pro0le. The measuring device (for example, a Fabry–Perot Interferometer) distorts the spectral line pro0le and the experimentally measured one is a convolution of this pro0le and the instrumental function. Restoring the spectral line pro0le is strongly a5ected by nu...
متن کاملA Simple SVD Algorithm for Finding Hidden Partitions
Finding a hidden partition in a random environment is a general and important problem, which contains as subproblems many important questions, such as finding a hidden clique, finding a hidden coloring, finding a hidden bipartition etc. In this paper, we provide a simple SVD algorithm for this purpose, answering a question of McSherry. This algorithm is easy to implement and works for sparse gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Special Matrices
سال: 2017
ISSN: 2300-7451
DOI: 10.1515/spma-2017-0013